A model and two heuristic methods for The Multi-Product Inventory-Location-Routing Problem with heterogeneous fleet

<p style='text-indent:20px;'>The Multi-Product Inventory-Location-Routing Problem with heterogeneous fleet considers a supply chain, which comprises multiple producers, potential distribution centers (DCs) opening capacity levels and geographically scattered retailers each of has deterministic demand over discrete planning horizon. The goal is determining set DCs their to open, assigning the opened DCs, finding product quantities be ordered by distributed from routes satisfy demands minimum cost. A mixed-integer linear programming model proposed describe problem, strengthened two valid inequalities. Since commercial solver can only solve very small-sized instances within reasonable time, heuristic methods are developed. Results show that inequalities effective both provide important savings in acceptable run times compared solver.</p>